Multi-Return Macro Tree Transducers
نویسندگان
چکیده
An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.
منابع مشابه
The Complexity of Translation Membership for Macro Tree Transducers
Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the “translation membership problem” is studied for mtts. For a fixed translation, the translation membership problem asks whether a given input/output pair is element of the translation. For call-by-name mtts this pro...
متن کاملComplexity and Expressiveness of Models of Xml Translations
XML has become widely used in computer industry, and the importance of static analysis and verification of applications manipulating XML documents is increasing. For analyzing or proving any properties on XML manipulating programs, it is essential to have some model with theoretically well-defined semantics. After a long history of researches on models of treeto-tree translations, a recent tren...
متن کاملA Pumping Lemma for Output Languages of Macro Tree Transducers
The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functional languages which are based on primitive recursion. In this paper, for output languages of producing and nondeleting macro tree transducers, we introduce and prove a pumping lemma. We apply this pumping lemma to gain two results: (1) there is no producing and nondeleti...
متن کاملMacro forest transducers
Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented as binary trees). On the other hand, the transformation of every mft can be simulated by the composition of two mt...
متن کاملMacro Tree Transducers
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. ...
متن کامل